搜索资源列表
dijkstra
- Dijkstra算法的基本思路是：假设每个点都有一对标号 (dj, pj)，其中dj是从起源点s到点j的最短路径的长度 (从顶点到其本身的最短路径是零路(没有弧的路)，其长度等于零)；pj则是从s到j的最短路径中j点的前一点。求解从起源点s-Dijkstra algorithm is the basic idea: the assumption that each point has a pair of numbers (dj, pj), which is a dj point s from
dijkstra
- 用C语言实现的最短路算法 算法描述清楚，未结合文件操作-Realized with C language algorithm for shortest path algorithm described in clear, no combination of file operations
Dijkstra-path
- 在已存在的一些最短路径算法测试总结的基础上，根据GIS中网络计算的实际情况，从网络结构的拓扑表示以及Dijkstra算法中快速搜索技术的实现实现方法。-Already exist in some of the shortest path algorithm test summary based on the GIS, the actual situation of network computing, from the topology of the network structure, as
Dijkstra_cpp
- c++ Example about Dijkstra shortest path. Works as a console application.
zuiduanlujingfenxi
- Dijkstra算法是求解网络中最短路径的精典算法，文中通过改变图的存储结构及搜索方法，减少了内存存储空间，缩短查询时间，以提高该算法在嵌入式GIS系统中路径优化的效率。-Dijkstra algorithm is to solve the classic shortest path network algorithm, the paper map by changing the storage structure and the search for ways to reduce the me
Dijkstra
- 这是一个C++编的Dijkstra算法，用于离散数学中求最短路径的问题。-This is a C++ compiled Dijkstra algorithm for shortest path problems in discrete mathematics.
zuiduanlujing
- 数据结构用Dijkstra算法和Floyd算法求最短路径问题，包括头文件和主文件-The data structure for the shortest path using Dijkstra algorithm and Floyd algorithm, including the header files and the master file
Cpp1
- dijkstra最短路径寻径算法之邻接表加堆排序的优化方法-adjacent table and heap sort Dijkstra shortest path routing algorithm optimization method
dijkstra
- Dijkstra算法关于最短路径算法的研究与实现-Research and Implementation of Dijkstra' s algorithm shortest path algorithm
dijkstraimplementation.tcl
- Dijkstra Shortest Path c++ implementation for NS2 tcl scr ipt
Dijkstra
- From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra’s algorithm.
dijkstra
- 大一时完成的求最短路径算法。利用C语言实现了经典的Dijkstra算法。转化矩阵图求取给定起点至其他结点的最短路径。 -Freshman completed the shortest path algorithm. Using C language to achieve a classic Dijkstra algorithm. Transformation matrix to strike the shortest path to a given starting point to oth
Dijkstra
- 大停电后完成寻找最短发电机启动效率算法，利用了经典Dijkstra算法。-After completion of the blackout efficient algorithm to find the shortest generator start using the classical Dijkstra algorithm.
Dijkstra
- 暴强Dijkstra算法求任意两点间最短路径(matlab程序)-Dijkstra algorithm for the shortest path between any two points (matlab)
dijkstra8
- shortest path dijkstra algorithm
Dijkstra.cs
- Find shortest path with Dijkstra
QPSK_modulation-and-Dijkstra-method
- 介绍了qpsk调制解调及Dijkstra最短路径算法，并给出了仿真的结果和程序。-Introduced qpsk modem and Dijkstra shortest path algorithm, and the simulation results and procedures.
dijkstra
- This a matlab code programmed for the dijkstra algorithm in order to find the shortest path among the nodes.-This is a matlab code programmed for the dijkstra algorithm in order to find the shortest path among the nodes.
Test
- 最短路中的广度优先搜索，Dijkstra算法。网络算路问题的更优算法实现对于网络资源高效配置具有重要价值。题目是：给定一个带权重的有向图 G (V,E)，V 为顶点集，E 为有向边集，每一条有向边均有一个权 重。对于给定的顶点 s、t，以及 V 的子集 V ，寻找从 s 到 t 的不成环有向路径 P，使得 P 经过 V 中所有的顶点(对经过 V 中节点的顺序不做要求)。 若不存在这样的有向路径 P，则输出无解，程序运行时间越短，则视为结果越优；若存在这 样的有向路径 P，则输出所得到的路径
tulun
- 在上传的资料‘tulun’中，PPT详细介绍了图论中的基本概念，并且给出了相应程序的算法，另外附有最短路Floyd算法的源程序和dijkstra的源程序。有利于在建模过程中利用MATLAB求解图论的相关问题。-PPT paper introduces the basic concepts of graph theory, algorithms and gives the corresponding program.Floyd also accompanied by the shortest ro